JOPSS - Search Results

Journal Articles

Benchmark solution for unstructured geometry PWR problem by method of characteristics using combinatorial geometry

Kugo, Teruhiko; Mori, Takamasa

Proceedings of International Topical Meeting on Mathematics and Computation, Supercomputing, Reactor Physics and Nuclear and Biological Applications (M&C 2005) (CD-ROM), 10 Pages, 2005/09

A new deterministic transport code based on the method of characteristics (MOC) has been developed for heterogeneous transport calculations in core design of innovative reactors which have complex structures. We have investigated the capability of the MOC code for general geometry with an unstructured geometry PWR problem. The comparison of the results with accurate Monte Carlo calculation results by GMVP has confirmed that the MOC code produces satisfactory results and has a capability to treat unstructured geometry.

JAEA Reports

MVP/GMVP 2; General purpose Monte Carlo codes for neutron and photon transport calculations based on continuous energy and multigroup methods

Nagaya, Yasunobu; Okumura, Keisuke; Mori, Takamasa; Nakagawa, Masayuki

JAERI 1348, 388 Pages, 2005/06

JAERI-1348.pdf:2.02MB

To realize fast and accurate Monte Carlo simulation of neutron and photon transport problems, two vectorized Monte Carlo codes MVP and GMVP have been developed at JAERI. MVP is based on the continuous energy model and GMVP is on the multigroup model. Compared with conventional scalar codes, these codes achieve higher computation speed by a factor of 10 or more on vector supercomputers. Both codes have sufficient functions for production use by adopting accurate physics model, geometry description capability and variance reduction techniques. The first version of the codes was released in 1994. They have been extensively improved and new functions have been implemented. The major improvements and new functions are (1) capability to treat the scattering model expressed with File 6 of the ENDF-6 format, (2) time-dependent tallies, (3) reaction rate calculation with the pointwise response function, (4) flexible source specification, etc. This report describes the physical model, geometry description method used in the codes, new functions and how to use them.

Journal Articles

Fast vector computation of the characteristics method

Kugo, Teruhiko

Journal of Nuclear Science and Technology, 39(3), p.256 - 263, 2002/03

https://doi.org/10.3327/jnst.39.256

Times Cited Count：3 Percentile：23.39(Nuclear Science & Technology)

Two vector computation algorithms; an odd-even sweep (OES) method and an independent sequential sweep (ISS) method, have been developed for the characteristics method to solve the neutron transport equation in a heterogeneous geometry. They realize long vector lengths without recursive operations for effective use of vector computers. Their efficiency has been investigated to a realistic fuel assembly calculation. For both methods, a vector computation is 15 times faster than a scalar computation. From a viewpoint of a comparison between the OES and ISS methods, the ISS method is superior to the OES method because the ISS method shows a faster convergence and saves a computer memory without reducing a computation speed.

JAEA Reports

Fast computation of the characteristics method on vector computers

Kugo, Teruhiko

JAERI-Research 2001-051, 39 Pages, 2001/11

JAERI-Research-2001-051.pdf:2.04MB

Fast computation of the characteristics method to solve the neutron transport equation in a heterogeneous geometry has been studied. Two vector computation algorithms; an odd-even sweep (OES) method and an independent sequential sweep (ISS) method have been developed and their efficiency to a typical fuel assembly calculation has been investigated. For both methods, a vector computation is 15 times faster than a scalar computation. From a viewpoint of comparison between the OES and ISS methods, the ISS method is superior to the OES method because the ISS method shows a faster convergence and saves a computer memory without reducing a computation speed. In the vector computation, a table-look-up method to reduce computation time of an exponential function saves only 20% of a whole computation time. Both the coarse mesh rebalance method and the Aitken acceleration method are effective as acceleration methods for the characteristics method, a combination of them saves 70-80% of outer iterations compared with a free iteration.

JAEA Reports